GPS analysis of multiple sessions with applications to admission control

نویسندگان

  • George Lapiotis
  • Shiwen Mao
  • Shivendra S. Panwar
چکیده

AhstructIn this paper we introduce a statistical method tn analyze multiplexing of multiple sessions sharing link bandwidth using GPS scheduling. Our method is shown to substantially improve previous upper bounds for GPS scheduling of MMPP sessions, especially as the number of sessions increases. Application of analytical results to admission control indicate that by sharing handwidth using GPS among traffic classcs there are significant gains over systems that statically segregate the link bandwidth. This effect is quantified in several experiments where various combinations of source types are used. The gains are pronounced when bursty sources with stricter QoS requirements are used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized processor sharing scheduling enhancement through session decomposition

In this paper a service discipline, which is based on Generalized Processor Sharing (GPS) and aims to improve resource utilization for deterministic guarantees at a single node is presented. According to the proposed scheme original sessions are decomposed into two components which are treated as separate sessions by a GPS scheduler; the work assigned to each session components is mapped back t...

متن کامل

Modified Rectangular Patch Antenna Loaded With Multiple C Slots for Multiple Applications

A new multiple C-slotted microstrip patch antenna is proposed in the present study. A patch antenna is a wide-beam narrowband antenna. The microstrip patch antenna consists of a very thin metallic strip (patch) placed a small fraction of a wavelength above a ground plane. The patch can be designed in any possible shape and normally made of conducting materials such as copper or gold. This study...

متن کامل

Probabilistic End-to-End Delay Bounds for Earliest Deadline First Scheduling

We analyze the Earliest-Deadline-First (EDF) scheduling discipline within the framework of statistical multiplexing. We derive techniques for bounding the probability of delay violations when the session injections are independent. This enables us to determine whether a given set of sessions can all meet their delay bounds with the required violation probability. These techniques can be used by...

متن کامل

Large Deviations and the Generalized Processor Sharing Scheduling: Upper and Lower Bounds Part II: Multiple-Queue Systems

We prove asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a single constant service rate server queue shared by multiple sessions with the generalized processor sharing (GPS) scheduling discipline. The special case of a two-queue GPS system has been dealt with separately in Part I of the paper [33], where exact bounds are obtained...

متن کامل

Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions

Generalized Processor Sharing (GPS) is an ideal fluid scheduling discipline that supports well defined delay and loss bounds on Leakybucket constrained traffic. Its packetized versions (WFQ, WF2Q, PGPS etc...) are considered as the packet scheduler of choice in IP routers and ATM switches of the future. The currently accepted approach for the design of GPS schedulers is based on deterministic Q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001